Faster fully compressed pattern matching algorithm for a subclass of straight-line programs

We show an efficient pattern-matching algorithm for strings that are succinctly described in terms of straight-line programs, in which the constants are symbols and the only operation is the concatenation. In this paper, both text T and pattern P are given by straight-line programs T and P. The length of the text T (pattern P , resp.) may grow exponentially with respect to its description size ||T || = n (||P|| = m, resp.). The best known algorithm for the problem runs in O(n2m2) time using O(nm) space. In this paper, we show a nontrivial subclass of straight-line programs, for which we develop an O(nm) time pattern matching algorithm using O(nm) space.